Axiomatizations for Propositional and Modal Team Logic
نویسنده
چکیده
A framework is developed that extends Hilbert-style proof systems for propositional and modal logics to comprehend their team-based counterparts. The method is applied to classical propositional logic and the modal logic K. Complete axiomatizations for their team-based extensions, propositional team logic PTL and modal team logic MTL, are presented. 1998 ACM Subject Classification F.4.1 Mathematical Logic
منابع مشابه
The Axioms of Team Logic
A framework is developed that extends calculi for propositional, modal and predicate logics to calculi for team-based logics. This method is applied to classical and quantified propositional logic, first-order logic and the modal logic K. Complete axiomatizations for propositional team logic PTL, quantified propositional team logic QPTL, modal team logic MTL and the dependence-atom-free fragmen...
متن کاملAxiomatizing Propositional Dependence Logics
We give sound and complete Hilbert-style axiomatizations for propositional dependence logic (PD), modal dependence logic (MDL), and extended modal dependence logic (EMDL) by extending existing axiomatizations for propositional logic and modal logic. In addition, we give novel labeled tableau calculi for PD, MDL, and EMDL. We prove soundness, completeness and termination for each of the labeled ...
متن کاملOn Extensions and Variants of Dependence Logic — A study of intuitionistic connectives in the team semantics setting
Dependence logic is a new logic which incorporates the notion of “dependence”, as well as “independence” between variables into first-order logic. In this thesis, we study extensions and variants of dependence logic on the first-order, propositional and modal level. In particular, the role of intuitionistic connectives in this setting is emphasized. We obtain, among others, the following result...
متن کاملThe Basic Logic of Proofs
Propositional Provability Logic was axiomatized in [7]. This logic describes the behaviour of the arithmetical operator \y is provable". The aim of the current paper is to provide propositional axiomatizations of the predicate \x is a proof of y" by means of modal logic, with the intention of meeting some of the needs of computer science.
متن کاملTowards Determining the Subset Relation between Propositional Modal Logics
We present design and implementation of a system that tries to automatically determine the subset relation between two given axiomatizations of almost arbitrary propositional modal logics, which is an open challenge problem for automated theorem proving. A test suite shows that relatively simple strategies can lead to satisfactory results, but also that certain subproblems are hard for current ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016